A construction which relates c-freeness to infinitesimal freeness
نویسندگان
چکیده
منابع مشابه
Testing Pattern-Freeness
Understanding the local behaviour of structured multi-dimensional data is a fundamental problem in various areas of computer science. As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically property testers, to understand local properties of the data. We focus on the natural local problem of testing pattern freeness: given a large d-dimensional...
متن کاملDistributedly Testing Cycle-Freeness
We tackle local distributed testing of graph properties. This framework is well suited to contexts in which data dispersed among the nodes of a network can be collected by some central authority (like in, e.g., sensor networks). In local distributed testing, each node can provide the central authority with just a few information about what it perceives from its neighboring environment, and, bas...
متن کاملContext-freeness Revisited
A series of papers have appeared investigating the ability of various species to learn context-free languages. From a computational point of view, the experiments in this tradition suffer from a number of problems concerning the stimuli used in the training phase of the experiments, the controls presented in the test phase of the experiments, and the motivation for and the conclusions drawn fro...
متن کاملFormalising Receipt-Freeness
Receipt-freeness is the property of voting protocols that a voter cannot create a receipt which proves how she voted. Since Benaloh and Tuinstra introduced this property, there has been a large amount of work devoted to the construction of receipt-free voting protocols. This paper provides a generic and uniform formalism that captures the notion of a receipt. The formalism is then applied to an...
متن کاملA SURVEY ON k–FREENESS
Abstract. We say that an integer n is k–free (k ≥ 2) if for every prime p the valuation vp(n) < k. If f : N → Z, we consider the enumerating function S f (x) defined as the number of positive integers n ≤ x such that f(n) is k–free. When f is the identity then S f (x) counts the k–free positive integers up to x. We review the history of S f (x) in the special cases when f is the identity, the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2019
ISSN: 0196-8858
DOI: 10.1016/j.aam.2019.06.002